Spectral Clustering With
نویسندگان
چکیده
Clustering is a fundamental problem in machine learning with numerous important applications in statistical signal processing, pattern recognition, and computer vision, where unsupervised analysis of data classification structures are required. The current stateof-the-art in clustering is widely accepted to be the socalled spectral clustering. Spectral clustering, based on pairwise affinities of samples imposes very large computational requirements. In this paper, we propose a vector quantization preprocessing stage for spectral clustering similar to the classical mean-shift principle for clustering. This preprocessing reduces the dimensionality of the matrix on which spectral techniques will be applied, resulting in significant computational savings.
منابع مشابه
Application of Combined Local Object Based Features and Cluster Fusion for the Behaviors Recognition and Detection of Abnormal Behaviors
In this paper, we propose a novel framework for behaviors recognition and detection of certain types of abnormal behaviors, capable of achieving high detection rates on a variety of real-life scenes. The new proposed approach here is a combination of the location based methods and the object based ones. First, a novel approach is formulated to use optical flow and binary motion video as the loc...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملحاشیهنویسی تصویر با استفاده از الگوریتم خوشهبندی نیمه نظارتی طیفی
Abstract: Due to the growth of digital images require efficient methods to annotate the images is sense. In this paper, a semi-supervised spectral clustering with relevance feedback is used to annotate digital photos which is overcome the local minima problem on clustering methods by using some labeled information given by users. Performance of the proposed method is tested on Corel 5K dataset ...
متن کاملتجزیه ی تُنُک تصاویر ابرطیفی با استفاده از یک کتابخانه ی طیفی هرس شده
Spectral unmixing of hyperspectral images is one of the most important research fields in remote sensing. Recently, the direct use of spectral libraries in spectral unmixing is on increase. In this way which is called sparse unmixing, we do not need an endmember extraction algorithm and the number determination of endmembers priori. Since spectral libraries usually contain highly correlated s...
متن کاملA Genetic Spectral Clustering Algorithm
As a novel clustering algorithm, spectral clustering is applied in machine learning extensively. Spectral clustering is built upon spectral graph theory, and has the ability to process the clustering of non-convex sample spaces. Most of the existing spectral clustering algorithms are based on k-means algorithm, and k-means algorithm uses the iterative optimization method to find the optimal sol...
متن کاملNoise Thresholds for Spectral Clustering
Although spectral clustering has enjoyed considerable empirical success in machine learning, its theoretical properties are not yet fully developed. We analyze the performance of a spectral algorithm for hierarchical clustering and show that on a class of hierarchically structured similarity matrices, this algorithm can tolerate noise that grows with the number of data points while still perfec...
متن کامل